Matroid T‐Connectivity
نویسندگان
چکیده
منابع مشابه
Covering matroid
In this paper, we propose a new type of matroids, namely covering matroids, and investigate the connections with the second type of covering-based rough sets and some existing special matroids. Firstly, as an extension of partitions, coverings are more natural combinatorial objects and can sometimes be more efficient to deal with problems in the real world. Through extending partitions to cover...
متن کاملMatroid Intersection
Last lecture we covered matroid intersection, and defined matroid union. In this lecture we review the definitions of matroid intersection, and then show that the matroid intersection polytope is TDI. This is Chapter 41 in Schrijver’s book. Next we review matroid union, and show that unlike matroid intersection, the union of two matroids is again a matroid. This material is largely contained in...
متن کاملMatroid Homology
We construct chain complexes of matroids and Lagrangian symplectic matroids analogous to Kontsevich graph homology.
متن کاملMatroid theory
The comments below apply to all printings of the book dated 2005 or earlier. The table following contains more than just a list of typing errors. Some statements and proofs have been corrected, simplified, or clarified. Moreover, the current status has been given for all the unsolved problems or conjectures that appear in Chapter 14. For those changes that simply involve the insertion of extra ...
متن کاملMatroid Regression
We propose an algebraic combinatorial method for solving large sparse linear systems of equations locally that is, a method which can compute single evaluations of the signal without computing the whole signal. The method scales only in the sparsity of the system and not in its size, and allows to provide error estimates for any solution method. At the heart of our approach is the so-called reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2006
ISSN: 0895-4801,1095-7146
DOI: 10.1137/050634190